In 1969, De Jongh proved the “maximality” of a fragment of intuitionistic predicate calculus forHA. Leivant strengthened the theorem in 1975, using proof-theoretical tools (normalisation of infinitary sequent calculi). By a refinement of De Jongh's original method (using Beth models instead of Kripke models and sheafs of partial combinatory algebras), a semantical proof is given of a result that is almost as good as Leivant's. Furthermore, it is shown thatHA can be extended to Higher Order Heyting Arithmetic+all trueΠ 2 0 (...) -sentences + transfinite induction over primitive recursive well-orderings. As a corollary of the proof, maximality of intuitionistic predicate calculus is established wrt. an abstract realisability notion defined over a suitable expansion ofHA. (shrink)

V. Lifschitz defined in 1979 a variant of realizability which validates Church's thesis with uniqueness condition, but not the general form of Church's thesis. In this paper we describe an extension of intuitionistic arithmetic in which the soundness of Lifschitz' realizability can be proved, and we give an axiomatic characterization of the Lifschitz-realizable formulas relative to this extension. By a "q-variant" we obtain a new derived rule. We also show how to extend Lifschitz' realizability to second-order arithmetic. Finally we describe (...) an analogous development for elementary analysis, with partial continuous application replacing partial recursive application. (shrink)

Following the book Algebraic Set Theory from André Joyal and leke Moerdijk [8], we give a characterization of the initial ZF-algebra, for Heyting pretoposes equipped with a class of small maps. Then, an application is considered (the effective topos) to show how to recover an already known model (McCarty [9]).

The purpose of this note is to observe a generalization of the concept "computable in..." to arbitrary partial combinatory algebras. For every partial combinatory algebra (pca) A and every partial endofunction on A, a pca A[f] is constructed such that in A[f], the function f is representable by an element; a universal property of the construction is formulated in terms of Longley's 2-category of pcas and decidable applicative morphisms. It is proved that there is always a geometric inclusion from the (...) realizability topos on A[f] into the one on A and that there is a meaningful preorder on the partial endofunctions on A which generalizes Turing reducibility. (shrink)

Kleene's realizability interpretation for first-order arithmetic was shown by Hyland to fit into the internal logic of an elementary topos, the “Effective topos” . In this paper it is shown, that there is an internal realizability definition in , i.e. a syntactical translation of the internal language of into itself of form “n realizes ” , which extends Kleene's definition, and such that for sentences , the equivalence [harr]n is true in . The internal realizability definition depends on finding separated (...) covers for non-separated objects of . However, for the objects arising in higher-order arithmetic, canonical covers are available, which are definable in higher-order arithmetic. These canonical covers yield “covering axioms”. It is shown that these covering axioms, together with uniformity principles and Extended Church's Thesis, axiomatize a formalized extension of Kleene realizability to a constructive system of higher-order arithmetic. The details are worked out for second and third-order arithmetic, but the method can be extended to any order. As an application, it is shown in the final section that a certain completeness property of the category of “modest sets” can be derived in third-order arithmetic from the realizability axioms. (shrink)

Two straightforward “extensionalisations” of Kleene's realizability are considered; denoted re and e. It is shown that these realizabilities are not equivalent. While the re-notion is a subset of Kleene's realizability, the e-notion is not. The problem of an axiomatization of e-realizability is attacked and one arrives at an axiomatization over a conservative extension of arithmetic, in a language with variables for finite sets. A derived rule for arithmetic is obtained by the use of a q-variant of e-realizability; this rule subsumes (...) the well-known Extended Church's Rule. The second part of the paper focuses on toposes for these realizabilities. By a relaxation of the notion of partial combinatory algebra, a new class of realizability toposes emerges. Relationships between the various realizability toposes are given, and results analogous to Robinson and Rosolini's characterization of the effective topos, are obtained for a topos generalizing e-realizability. (shrink)

The classical forms of both modified realizability and relative realizability are naturally described in terms of the Sierpinski topos. The paper puts these two observations together and explains abstractly the existence of the geometric morphisms and logical functors connecting the various toposes at issue. This is done by advancing the theory of triposes over internal partial combinatory algebras and by employing a novel notion of elementary map.

We study the lattice of local operators in Hylandʼs Effective Topos. We show that this lattice is a free completion under internal sups indexed by the natural numbers object, generated by what we call basic local operators.We produce many new local operators and we employ a new concept, sight, in order to analyze these.We show that a local operator identified by A.M. Pitts in his thesis, gives a subtopos with classical arithmetic.

An axiomatic treatment of synthetic domain theory is presented, in the framework of the internal logic of an arbitrary topos. We present new proofs of known facts, new equivalences between our axioms and known principles, and proofs of new facts, such as the theorem that the regular complete objects are closed under lifting . In Sections 2–4 we investigate models, and obtain independence results. In Section 2 we look at a model in de Modified realizability Topos, where the Scott Principle (...) fails, and the complete objects are not closed under lifting. Section 3 treats the standard model in the Effective Topos. Theorem 3.2 gives a new characterization of the initial lift-algebra relative to the dominance. We prove that in the standard case it is not the internal colimit of the chain 0 → L → L 2 → ⋯ . The models in Sections 2 and 3 compare via an adjunction. Section 4 discusses a model in a Grothendieck topos. A feature here is that N is not well-complete , whereas 2 is. (shrink)

F. Richman raised the question of whether the following principle of second order arithmetic is valid in intuitionistic higher order arithmetic $\mathbf{HAH}$: $\forall X\lbrack\forall x(x \in X \vee \neg x \in X) \wedge \forall Y(\forall x(x \in Y \vee \neg x \in Y) \rightarrow \forall x(x \in X \rightarrow x \in Y) \vee \forall x \neg(x \in X \wedge x \in Y)) \rightarrow \exists n\forall x(x \in X \rightarrow x = n)\rbrack$, and if not, whether assuming Church's Thesis CT and (...) Markov's Principle MP would help. Blass and Scedrov gave models of $\mathbf{HAH}$ in which this principle, which we call RP, is not valid, but their models do not satisfy either CT or MP. In this paper a realizability topos Lif is constructed in which CT and MP hold, but RP is false. (It is shown, however, that $RP$ is derivable in $\mathbf{HAH} + \mathrm{CT} + \mathrm{MP} + \mathrm{ECT}_0$, so RP holds in the effective topos.) Lif is a generalization of a realizability notion invented by V. Lifschitz. Furthermore, Lif is a subtopos of the effective topos. (shrink)

We employ the notions of "sequential function" and "interrogation" (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using Longley's preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is that every realizability topos is a geometric quotient of a realizability topos on a total combinatory algebra.